Flow-shop scheduling problem under uncertainties: Review and trends
نویسندگان
چکیده
منابع مشابه
Flow shop Scheduling Problem with Maintenance Coordination: a New Approach
This study investigates the coordination of production scheduling and maintenance planning in theflow shop scheduling environment. The problem is considered in a bi-objective form, minimizing themakespan as the production scheduling criterion and minimizing the system unavailability as themaintenance planning criterion. The time interval between consecutive maintenance activities as well as the...
متن کاملSolving Re-entrant No-wait Flow Shop Scheduling Problem
In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...
متن کاملA Cooperative Approach for Job Shop Scheduling under Uncertainties
This paper focuses on job shop scheduling problems in a cooperative environment. Unlike classical deterministic approaches, we assume that jobs are not known in advance but occur randomly during the production process, as orders appear. Therefore, the production schedule is adapted in a reactive manner all along the production process. These schedule adaptations are made according to a cooperat...
متن کاملThe hybrid flow shop scheduling problem
The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed f...
متن کاملInverse scheduling: two-machine flow-shop problem
We study an inverse counterpart of the two machine flow-shop scheduling problem that arises in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find job sequence(s) for which the value of the makespan is minimum, in the inverse scheduling the exact values of processing times are unknown and they should be selected with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2017
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2017.2.001